Numeration Systems, Linear Recurrences, and Regular Sets
نویسنده
چکیده
A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2, . . . expresses a non-negative integer n as a sum n = ∑i j=0 ajuj . In this case we say the string aiai−1 · · · a1a0 is a representation for n. If gcd(u0, u1, . . .) = g, then every sufficiently large multiple of g has some representation. If the lexicographic ordering on the representations is the same as the usual ordering of the integers, we say the numeration system is order-preserving. In particular, if u0 = 1, then the greedy representation, obtained via the greedy algorithm, is orderpreserving. We prove that, subject to some technical assumptions, if the set of all representations in an order-preserving numeration system is regular, then the sequence u = (uj)j≥0 satisfies a linear recurrence. The converse, however, is not true. The proof uses two lemmas about regular sets that may be of independent interest. The first shows that if L is regular, then the set of lexicographically greatest strings of every length in L is also regular. The second shows that the number of strings of length n in a regular language L is bounded by a constant (independent of n) iff L is the finite union of sets of the form xy∗z.
منابع مشابه
Additive Functions with Respect to Numeration Systems on Regular Languages
Additive numeration systems and the corresponding additive arithmetic functions have been studied from various points of view since the seminal papers of H. Delange [4, 5], where such functions were investigated for the usual q-adic numeration system. Later more exotic systems of numeration, such as general linear numeration systems [13, 14], especially such systems defined by linear recurring ...
متن کاملSome results about numeration systems on a regular language : Formal power series and Multiplication by a constant in the polynomial case
Generalizations of numeration systems in which N is recognizable by finite automata are obtained by describing a lexicographically ordered infinite regular language. For these systems of numeration, we obtain a characterization of the recognizable sets of integers in terms of rational formal series. We also show that, for a numeration system constructed on a regular language of density in Θ(n),...
متن کاملMulti-dimensional sets recognizable in all abstract numeration systems
numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order (induced by <), we define a one-to-one correspondence between N and L repS : N → L : n 7→ (n + 1)th word of L valS = rep −1 S : L → N Abstract numeration systems Example S = (a∗b∗, {a, b}, a < b) L...
متن کاملCombinatorics, Automata and Number Theory
numeration systems The motivation for the introduction of abstract numeration systems stemsfrom the celebrated theorem of Cobham dating back to 1969 about the so-called recognisable sets of integers in any integer base numeration system.An abstract numeration system is simply an infinite genealogically ordered(regular) language. In particular, this notion extends the usual integ...
متن کاملRegular Maps in Generalized Number Systems
This paper extends some results of Allouche and Shallit for q-regular sequences to numeration systems in algebraic number elds and to linear numeration systems. We also construct automata that perform addition and multiplication by a xed number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 113 شماره
صفحات -
تاریخ انتشار 1994